./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:22:44,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:22:44,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:22:44,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:22:44,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:22:44,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:22:44,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:22:44,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:22:44,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:22:44,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:22:44,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:22:44,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:22:44,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:22:44,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:22:44,558 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:22:44,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:22:44,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:22:44,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:22:44,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:22:44,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:22:44,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:22:44,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:22:44,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:22:44,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:22:44,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:22:44,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:22:44,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:22:44,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:22:44,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:22:44,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:22:44,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:22:44,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:22:44,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:44,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:22:44,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:22:44,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:22:44,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:22:44,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:22:44,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:22:44,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:22:44,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:22:44,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:22:44,567 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 [2024-11-19 00:22:44,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:22:44,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:22:44,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:22:44,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:22:44,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:22:44,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2024-11-19 00:22:46,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:22:46,599 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:22:46,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2024-11-19 00:22:46,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ee166f6/2b09a818d5e24395bf18d9b9c8d130a1/FLAGb7c164232 [2024-11-19 00:22:46,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ee166f6/2b09a818d5e24395bf18d9b9c8d130a1 [2024-11-19 00:22:46,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:22:46,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:22:46,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:46,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:22:46,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:22:46,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:46,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea68bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46, skipping insertion in model container [2024-11-19 00:22:46,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:46,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:22:46,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i[912,925] [2024-11-19 00:22:46,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:46,930 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:22:46,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i[912,925] [2024-11-19 00:22:46,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:46,998 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:22:46,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46 WrapperNode [2024-11-19 00:22:46,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:47,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:47,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:22:47,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:22:47,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,057 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-19 00:22:47,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:47,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:22:47,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:22:47,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:22:47,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,091 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:22:47,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:22:47,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:22:47,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:22:47,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:22:47,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (1/1) ... [2024-11-19 00:22:47,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:47,143 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-19 00:22:47,154 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-19 00:22:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:22:47,199 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:22:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:22:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:22:47,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:22:47,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:22:47,313 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:22:47,316 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:22:47,605 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-19 00:22:47,605 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:22:47,623 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:22:47,623 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:22:47,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:47 BoogieIcfgContainer [2024-11-19 00:22:47,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:22:47,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:22:47,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:22:47,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:22:47,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:22:46" (1/3) ... [2024-11-19 00:22:47,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7276cc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:47, skipping insertion in model container [2024-11-19 00:22:47,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:46" (2/3) ... [2024-11-19 00:22:47,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7276cc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:47, skipping insertion in model container [2024-11-19 00:22:47,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:47" (3/3) ... [2024-11-19 00:22:47,635 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-3.i [2024-11-19 00:22:47,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:22:47,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:22:47,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:22:47,735 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;@2db6462f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:22:47,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:22:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:22:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:22:47,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:47,749 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:22:47,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:47,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash 55740261, now seen corresponding path program 1 times [2024-11-19 00:22:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:47,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179772940] [2024-11-19 00:22:47,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:22:48,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179772940] [2024-11-19 00:22:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179772940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:22:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431633107] [2024-11-19 00:22:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:48,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:22:48,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:48,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:22:48,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:22:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:48,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:22:48,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-19 00:22:48,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431633107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:22:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:22:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64997638] [2024-11-19 00:22:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:22:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:48,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:22:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:22:48,286 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:22:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:48,310 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-19 00:22:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:22:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-19 00:22:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:48,319 INFO L225 Difference]: With dead ends: 97 [2024-11-19 00:22:48,320 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 00:22:48,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-19 00:22:48,326 INFO L432 NwaCegarLoop]: 69 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, 69 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-19 00:22:48,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:22:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 00:22:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 00:22:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:22:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-19 00:22:48,367 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2024-11-19 00:22:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:48,368 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-19 00:22:48,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:22:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-19 00:22:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:22:48,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:48,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:22:48,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:22:48,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:22:48,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:48,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 322939501, now seen corresponding path program 1 times [2024-11-19 00:22:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807220154] [2024-11-19 00:22:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:22:49,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:49,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807220154] [2024-11-19 00:22:49,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807220154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:49,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:49,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:22:49,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776791086] [2024-11-19 00:22:49,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:49,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:22:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:22:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:22:49,098 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:22:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:49,154 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2024-11-19 00:22:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:22:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-19 00:22:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:49,160 INFO L225 Difference]: With dead ends: 138 [2024-11-19 00:22:49,162 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 00:22:49,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:22:49,165 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:49,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:22:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 00:22:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-19 00:22:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:22:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-11-19 00:22:49,207 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2024-11-19 00:22:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:49,208 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-11-19 00:22:49,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:22:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-11-19 00:22:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:22:49,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:49,213 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:22:49,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:22:49,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:49,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 380197803, now seen corresponding path program 1 times [2024-11-19 00:22:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760476620] [2024-11-19 00:22:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:49,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:22:49,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:22:49,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760476620] [2024-11-19 00:22:49,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760476620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:22:49,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380747392] [2024-11-19 00:22:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:49,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:22:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:49,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:22:49,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 00:22:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:49,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:22:49,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-19 00:22:50,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:22:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:22:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380747392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:22:50,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 00:22:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-19 00:22:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344105788] [2024-11-19 00:22:50,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 00:22:50,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:22:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:22:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:22:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:22:50,410 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-19 00:22:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:50,626 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-11-19 00:22:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:22:50,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2024-11-19 00:22:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:50,633 INFO L225 Difference]: With dead ends: 193 [2024-11-19 00:22:50,633 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 00:22:50,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:22:50,637 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:50,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:22:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 00:22:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-19 00:22:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:22:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-19 00:22:50,655 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2024-11-19 00:22:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:50,656 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-19 00:22:50,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-19 00:22:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-19 00:22:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:22:50,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:50,658 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:22:50,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:22:50,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 00:22:50,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:50,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash 382044845, now seen corresponding path program 1 times [2024-11-19 00:22:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:22:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466117379] [2024-11-19 00:22:50,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:50,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:22:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:22:50,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:22:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:22:51,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:22:51,015 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:22:51,017 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:22:51,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:22:51,022 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 00:22:51,122 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:22:51,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:22:51 BoogieIcfgContainer [2024-11-19 00:22:51,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:22:51,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:22:51,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:22:51,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:22:51,127 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:47" (3/4) ... [2024-11-19 00:22:51,130 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:22:51,131 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:22:51,132 INFO L158 Benchmark]: Toolchain (without parser) took 4499.85ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 92.9MB in the beginning and 64.6MB in the end (delta: 28.4MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-11-19 00:22:51,132 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:22:51,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.80ms. Allocated memory is still 146.8MB. Free memory was 92.9MB in the beginning and 78.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:22:51,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.46ms. Allocated memory is still 146.8MB. Free memory was 78.6MB in the beginning and 116.9MB in the end (delta: -38.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:22:51,133 INFO L158 Benchmark]: Boogie Preprocessor took 48.05ms. Allocated memory is still 146.8MB. Free memory was 116.9MB in the beginning and 114.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:22:51,133 INFO L158 Benchmark]: RCFGBuilder took 516.35ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 106.4MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 00:22:51,133 INFO L158 Benchmark]: TraceAbstraction took 3498.46ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 105.6MB in the beginning and 64.6MB in the end (delta: 41.0MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-11-19 00:22:51,134 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 176.2MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:22:51,135 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.18ms. Allocated memory is still 96.5MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.80ms. Allocated memory is still 146.8MB. Free memory was 92.9MB in the beginning and 78.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.46ms. Allocated memory is still 146.8MB. Free memory was 78.6MB in the beginning and 116.9MB in the end (delta: -38.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.05ms. Allocated memory is still 146.8MB. Free memory was 116.9MB in the beginning and 114.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 516.35ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 106.4MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3498.46ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 105.6MB in the beginning and 64.6MB in the end (delta: 41.0MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 176.2MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. * 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someUnaryDOUBLEoperation at line 33. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 15.75; [L33] double var_1_14 = -0.5; [L34] double var_1_15 = 5.25; [L35] double var_1_16 = 8.5; [L36] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L74] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L75] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L75] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L77] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L78] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L78] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=-5] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L86] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L88] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L90] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L91] var_1_16 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L92] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L41] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L46] signed long int stepLocal_2 = var_1_7; [L47] signed long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, stepLocal_2=-1073741823, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L48] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L55] COND FALSE !(! var_1_11) [L58] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L60] COND FALSE !(\read(var_1_4)) [L63] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_11) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_1 || (! var_1_5))))) : 1)) && (var_1_4 ? (var_1_12 == ((double) (((((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) < ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))))))) ? ((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) : ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16)))))))))) : (var_1_12 == ((double) var_1_15))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=505, var_1_15=505, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-1610612734, var_1_7=-1073741823, var_1_8=-1073741822, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 183 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304 SizeOfPredicates, 1 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2724/2880 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-19 00:22:51,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:22:53,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:22:53,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:22:53,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:22:53,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:22:53,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:22:53,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:22:53,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:22:53,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:22:53,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:22:53,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:22:53,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:22:53,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:22:53,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:22:53,599 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:22:53,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:22:53,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:22:53,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:22:53,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:22:53,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:22:53,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:22:53,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:22:53,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:22:53,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:22:53,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:22:53,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:22:53,606 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:22:53,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:22:53,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:22:53,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:22:53,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:22:53,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:22:53,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:22:53,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:22:53,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:53,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:22:53,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:22:53,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:22:53,609 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:22:53,609 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:22:53,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:22:53,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:22:53,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:22:53,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:22:53,611 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 [2024-11-19 00:22:53,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:22:53,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:22:54,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:22:54,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:22:54,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:22:54,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2024-11-19 00:22:55,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:22:55,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:22:55,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2024-11-19 00:22:55,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d863473f2/c21d9a233e74421893473afac12fbf7a/FLAGabe9e5b45 [2024-11-19 00:22:55,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d863473f2/c21d9a233e74421893473afac12fbf7a [2024-11-19 00:22:55,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:22:55,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:22:55,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:55,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:22:55,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:22:55,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:55" (1/1) ... [2024-11-19 00:22:55,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a2e6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:55, skipping insertion in model container [2024-11-19 00:22:55,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:22:55" (1/1) ... [2024-11-19 00:22:55,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:22:56,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i[912,925] [2024-11-19 00:22:56,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:56,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:22:56,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i[912,925] [2024-11-19 00:22:56,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:22:56,327 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:22:56,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56 WrapperNode [2024-11-19 00:22:56,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:22:56,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:56,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:22:56,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:22:56,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,387 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-19 00:22:56,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:22:56,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:22:56,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:22:56,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:22:56,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,429 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:22:56,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:22:56,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:22:56,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:22:56,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:22:56,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (1/1) ... [2024-11-19 00:22:56,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:22:56,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:22:56,502 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-19 00:22:56,505 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-19 00:22:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:22:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:22:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:22:56,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:22:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:22:56,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:22:56,626 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:22:56,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:22:57,066 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-19 00:22:57,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:22:57,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:22:57,079 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:22:57,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:57 BoogieIcfgContainer [2024-11-19 00:22:57,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:22:57,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:22:57,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:22:57,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:22:57,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:22:55" (1/3) ... [2024-11-19 00:22:57,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493ba310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:57, skipping insertion in model container [2024-11-19 00:22:57,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:22:56" (2/3) ... [2024-11-19 00:22:57,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493ba310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:22:57, skipping insertion in model container [2024-11-19 00:22:57,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:22:57" (3/3) ... [2024-11-19 00:22:57,089 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-3.i [2024-11-19 00:22:57,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:22:57,109 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:22:57,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:22:57,186 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;@693325a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:22:57,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:22:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:22:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:22:57,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:57,202 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:22:57,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 55740261, now seen corresponding path program 1 times [2024-11-19 00:22:57,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016686947] [2024-11-19 00:22:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:57,219 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-19 00:22:57,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:57,220 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-19 00:22:57,222 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-19 00:22:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:57,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:22:57,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-19 00:22:57,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:57,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016686947] [2024-11-19 00:22:57,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016686947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:57,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:57,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:22:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941581040] [2024-11-19 00:22:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:57,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:22:57,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:57,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:22:57,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:22:57,535 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:22:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:57,560 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-19 00:22:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:22:57,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-19 00:22:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:57,568 INFO L225 Difference]: With dead ends: 97 [2024-11-19 00:22:57,568 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 00:22:57,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-19 00:22:57,575 INFO L432 NwaCegarLoop]: 69 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, 69 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-19 00:22:57,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:22:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 00:22:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 00:22:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 00:22:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-19 00:22:57,615 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2024-11-19 00:22:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:57,615 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-19 00:22:57,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 00:22:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-19 00:22:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:22:57,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:57,619 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:22:57,626 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-19 00:22:57,819 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-19 00:22:57,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 322939501, now seen corresponding path program 1 times [2024-11-19 00:22:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269682990] [2024-11-19 00:22:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:57,822 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-19 00:22:57,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:57,825 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-19 00:22:57,826 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-19 00:22:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:58,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 00:22:58,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 00:22:58,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:22:58,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:58,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269682990] [2024-11-19 00:22:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269682990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:22:58,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:22:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:22:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464659461] [2024-11-19 00:22:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:22:58,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:22:58,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:22:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:22:58,323 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:22:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:22:58,524 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2024-11-19 00:22:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:22:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-19 00:22:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:22:58,528 INFO L225 Difference]: With dead ends: 138 [2024-11-19 00:22:58,528 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 00:22:58,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:22:58,530 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:22:58,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:22:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 00:22:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-11-19 00:22:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:22:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-11-19 00:22:58,555 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2024-11-19 00:22:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:22:58,557 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-11-19 00:22:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 00:22:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-11-19 00:22:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:22:58,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:22:58,561 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:22:58,570 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-19 00:22:58,762 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-19 00:22:58,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:22:58,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:22:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash 380197803, now seen corresponding path program 1 times [2024-11-19 00:22:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:22:58,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901115584] [2024-11-19 00:22:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:22:58,765 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-19 00:22:58,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:22:58,768 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-19 00:22:58,769 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-19 00:22:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:22:58,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:22:58,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:22:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-11-19 00:22:59,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:22:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-19 00:22:59,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:22:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901115584] [2024-11-19 00:22:59,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901115584] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:22:59,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:22:59,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-19 00:22:59,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857370504] [2024-11-19 00:22:59,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:22:59,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:22:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:22:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:22:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:22:59,427 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-19 00:23:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:23:00,122 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-11-19 00:23:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:23:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2024-11-19 00:23:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:23:00,135 INFO L225 Difference]: With dead ends: 193 [2024-11-19 00:23:00,135 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 00:23:00,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:23:00,141 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 00:23:00,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 109 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 00:23:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 00:23:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-19 00:23:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-19 00:23:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-19 00:23:00,166 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2024-11-19 00:23:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:23:00,167 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-19 00:23:00,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-19 00:23:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-19 00:23:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 00:23:00,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:00,169 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:23:00,177 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-19 00:23:00,369 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-19 00:23:00,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:00,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash 382044845, now seen corresponding path program 1 times [2024-11-19 00:23:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:23:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120890182] [2024-11-19 00:23:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:00,372 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-19 00:23:00,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:23:00,376 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-19 00:23:00,378 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-19 00:23:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:00,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 00:23:00,642 INFO L278 TraceCheckSpWp]: Computing forward predicates...