/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-df9f019-m [2024-11-05 21:32:56,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 21:32:56,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 21:32:56,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 21:32:56,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 21:32:56,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 21:32:56,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 21:32:56,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 21:32:56,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 21:32:56,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 21:32:56,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 21:32:56,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 21:32:56,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 21:32:56,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 21:32:56,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 21:32:56,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 21:32:56,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 21:32:56,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 21:32:56,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 21:32:56,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 21:32:56,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 21:32:56,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 21:32:56,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 21:32:56,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 21:32:56,211 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 21:32:56,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 21:32:56,211 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 21:32:56,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 21:32:56,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 21:32:56,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 21:32:56,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 21:32:56,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 21:32:56,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 21:32:56,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 21:32:56,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 21:32:56,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 21:32:56,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 21:32:56,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 21:32:56,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 21:32:56,213 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 21:32:56,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 21:32:56,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 21:32:56,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 21:32:56,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 21:32:56,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:32:56,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 21:32:56,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 21:32:56,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 21:32:56,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 21:32:56,394 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 21:32:56,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i [2024-11-05 21:32:57,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 21:32:57,863 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 21:32:57,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i [2024-11-05 21:32:57,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23074029/8c65e453c6994f1e92a2bd89c38b9c8e/FLAG996836278 [2024-11-05 21:32:58,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23074029/8c65e453c6994f1e92a2bd89c38b9c8e [2024-11-05 21:32:58,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 21:32:58,212 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 21:32:58,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 21:32:58,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 21:32:58,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 21:32:58,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c16a47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58, skipping insertion in model container [2024-11-05 21:32:58,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 21:32:58,622 WARN L1674 CHandler]: Possible shadowing of function y1 [2024-11-05 21:32:58,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i[63118,63131] [2024-11-05 21:32:58,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 21:32:58,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 21:32:58,670 WARN L1674 CHandler]: Possible shadowing of function y1 [2024-11-05 21:32:58,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/neural-networks/elu_2_safe.c-amalgamation.i[63118,63131] [2024-11-05 21:32:58,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 21:32:58,771 INFO L204 MainTranslator]: Completed translation [2024-11-05 21:32:58,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58 WrapperNode [2024-11-05 21:32:58,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 21:32:58,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 21:32:58,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 21:32:58,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 21:32:58,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,822 INFO L138 Inliner]: procedures = 559, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2024-11-05 21:32:58,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 21:32:58,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 21:32:58,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 21:32:58,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 21:32:58,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,840 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-05 21:32:58,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 21:32:58,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 21:32:58,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 21:32:58,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 21:32:58,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (1/1) ... [2024-11-05 21:32:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 21:32:58,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 21:32:58,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 21:32:58,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 21:32:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure elu [2024-11-05 21:32:58,888 INFO L138 BoogieDeclarations]: Found implementation of procedure elu [2024-11-05 21:32:58,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 21:32:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 21:32:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 21:32:58,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 21:32:58,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 21:32:58,964 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 21:32:58,965 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 21:32:59,107 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-05 21:32:59,107 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 21:32:59,114 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 21:32:59,114 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-05 21:32:59,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:32:59 BoogieIcfgContainer [2024-11-05 21:32:59,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 21:32:59,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 21:32:59,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 21:32:59,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 21:32:59,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 09:32:58" (1/3) ... [2024-11-05 21:32:59,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f40411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:32:59, skipping insertion in model container [2024-11-05 21:32:59,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:32:58" (2/3) ... [2024-11-05 21:32:59,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f40411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:32:59, skipping insertion in model container [2024-11-05 21:32:59,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:32:59" (3/3) ... [2024-11-05 21:32:59,119 INFO L112 eAbstractionObserver]: Analyzing ICFG elu_2_safe.c-amalgamation.i [2024-11-05 21:32:59,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 21:32:59,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 21:32:59,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 21:32:59,170 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7eb13eda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 21:32:59,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 21:32:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-05 21:32:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 21:32:59,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 21:32:59,177 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 21:32:59,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 21:32:59,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 21:32:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1270606093, now seen corresponding path program 1 times [2024-11-05 21:32:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 21:32:59,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347599022] [2024-11-05 21:32:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 21:32:59,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:32:59,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 21:32:59,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 21:32:59,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 21:32:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 21:32:59,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 21:32:59,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 21:32:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 21:32:59,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 21:32:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 21:32:59,299 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 21:32:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347599022] [2024-11-05 21:32:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [347599022] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 21:32:59,300 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 21:32:59,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 21:32:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320858201] [2024-11-05 21:32:59,303 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 21:32:59,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 21:32:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 21:32:59,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 21:32:59,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 21:32:59,322 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 21:32:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 21:32:59,333 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-05 21:32:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 21:32:59,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 17 [2024-11-05 21:32:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 21:32:59,339 INFO L225 Difference]: With dead ends: 33 [2024-11-05 21:32:59,339 INFO L226 Difference]: Without dead ends: 14 [2024-11-05 21:32:59,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 21:32:59,343 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 21:32:59,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 21:32:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-05 21:32:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-05 21:32:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-05 21:32:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-05 21:32:59,366 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 17 [2024-11-05 21:32:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 21:32:59,367 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-05 21:32:59,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 21:32:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-05 21:32:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 21:32:59,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 21:32:59,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 21:32:59,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 21:32:59,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:32:59,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 21:32:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 21:32:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -9257585, now seen corresponding path program 1 times [2024-11-05 21:32:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 21:32:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108149080] [2024-11-05 21:32:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 21:32:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:32:59,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 21:32:59,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 21:32:59,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 21:32:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 21:32:59,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 21:32:59,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 21:33:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 21:33:02,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 21:33:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 21:33:06,542 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 21:33:06,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108149080] [2024-11-05 21:33:06,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1108149080] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 21:33:06,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 21:33:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-11-05 21:33:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049129360] [2024-11-05 21:33:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 21:33:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 21:33:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 21:33:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 21:33:06,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-05 21:33:06,545 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-05 21:33:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 21:33:24,726 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-05 21:33:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 21:33:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-05 21:33:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 21:33:24,732 INFO L225 Difference]: With dead ends: 24 [2024-11-05 21:33:24,732 INFO L226 Difference]: Without dead ends: 20 [2024-11-05 21:33:24,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2024-11-05 21:33:24,734 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-05 21:33:24,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-05 21:33:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-05 21:33:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-05 21:33:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-05 21:33:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-05 21:33:24,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 17 [2024-11-05 21:33:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 21:33:24,740 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-05 21:33:24,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-05 21:33:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-05 21:33:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 21:33:24,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 21:33:24,741 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 21:33:24,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 21:33:24,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:33:24,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 21:33:24,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 21:33:24,942 INFO L85 PathProgramCache]: Analyzing trace with hash 19371566, now seen corresponding path program 1 times [2024-11-05 21:33:24,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 21:33:24,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774318272] [2024-11-05 21:33:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 21:33:24,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:33:24,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 21:33:24,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 21:33:24,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 21:33:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 21:33:24,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 21:33:24,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 21:33:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 21:33:26,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 21:33:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-05 21:33:26,620 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 21:33:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774318272] [2024-11-05 21:33:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [774318272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 21:33:26,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 21:33:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-05 21:33:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502135821] [2024-11-05 21:33:26,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 21:33:26,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 21:33:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 21:33:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 21:33:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-05 21:33:26,622 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 21:33:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 21:33:31,008 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-05 21:33:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 21:33:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-11-05 21:33:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 21:33:31,011 INFO L225 Difference]: With dead ends: 30 [2024-11-05 21:33:31,011 INFO L226 Difference]: Without dead ends: 20 [2024-11-05 21:33:31,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-05 21:33:31,012 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-05 21:33:31,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-05 21:33:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-05 21:33:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2024-11-05 21:33:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 21:33:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-05 21:33:31,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 17 [2024-11-05 21:33:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 21:33:31,018 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-05 21:33:31,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 21:33:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-05 21:33:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 21:33:31,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 21:33:31,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 21:33:31,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-05 21:33:31,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:33:31,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 21:33:31,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 21:33:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash 119825134, now seen corresponding path program 2 times [2024-11-05 21:33:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 21:33:31,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898877702] [2024-11-05 21:33:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 21:33:31,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:33:31,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 21:33:31,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 21:33:31,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 21:33:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 21:33:31,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-05 21:33:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-05 21:33:31,324 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-05 21:33:31,325 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-05 21:33:31,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 21:33:31,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 21:33:31,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 21:33:31,532 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-05 21:33:31,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 21:33:31,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 09:33:31 BoogieIcfgContainer [2024-11-05 21:33:31,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 21:33:31,566 INFO L158 Benchmark]: Toolchain (without parser) took 33354.21ms. Allocated memory is still 358.6MB. Free memory was 312.4MB in the beginning and 183.1MB in the end (delta: 129.3MB). Peak memory consumption was 129.8MB. Max. memory is 8.0GB. [2024-11-05 21:33:31,567 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 196.1MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 21:33:31,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.26ms. Allocated memory is still 358.6MB. Free memory was 312.0MB in the beginning and 316.8MB in the end (delta: -4.8MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2024-11-05 21:33:31,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.32ms. Allocated memory is still 358.6MB. Free memory was 316.8MB in the beginning and 314.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 21:33:31,568 INFO L158 Benchmark]: Boogie Preprocessor took 25.87ms. Allocated memory is still 358.6MB. Free memory was 314.2MB in the beginning and 312.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 21:33:31,568 INFO L158 Benchmark]: RCFGBuilder took 265.55ms. Allocated memory is still 358.6MB. Free memory was 312.1MB in the beginning and 300.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-05 21:33:31,568 INFO L158 Benchmark]: TraceAbstraction took 32450.40ms. Allocated memory is still 358.6MB. Free memory was 300.0MB in the beginning and 183.1MB in the end (delta: 116.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. [2024-11-05 21:33:31,570 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 196.1MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 559.26ms. Allocated memory is still 358.6MB. Free memory was 312.0MB in the beginning and 316.8MB in the end (delta: -4.8MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.32ms. Allocated memory is still 358.6MB. Free memory was 316.8MB in the beginning and 314.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.87ms. Allocated memory is still 358.6MB. Free memory was 314.2MB in the beginning and 312.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.55ms. Allocated memory is still 358.6MB. Free memory was 312.1MB in the beginning and 300.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32450.40ms. Allocated memory is still 358.6MB. Free memory was 300.0MB in the beginning and 183.1MB in the end (delta: 116.9MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 859]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of expm1f at line 850. Possible FailurePath: [L854] float x1 = __VERIFIER_nondet_float(); [L855] float x2 = x1 + 1e-5f; VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L856] COND FALSE !(!(!__builtin_isnan (x1))) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L857] CALL, EXPR elu(x1) VAL [\old(x)=-0.00000000000000000010842021724855044] [L847] COND FALSE !(x >= 0.0f) [L850] return expm1f(x); [L857] RET, EXPR elu(x1) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L857] float y1 = elu(x1); [L858] CALL, EXPR elu(x2) VAL [\old(x)=0.000009999999747378752] [L847] COND TRUE x >= 0.0f [L848] return x; VAL [\old(x)=0.000009999999747378752, \result=0.000009999999747378752] [L858] RET, EXPR elu(x2) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752, y1=2.0] [L858] float y2 = elu(x2); [L859] COND TRUE !(__builtin_islessequal(y1, y2)) VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] [L859] reach_error() VAL [x1=-0.00000000000000000010842021724855044, x2=0.000009999999747378752] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 36 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 25.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 8 QuantifiedInterpolants, 459 SizeOfPredicates, 6 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 16/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-05 21:33:31,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...