./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-91.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 5f16d1adb8682acc1fc66a4b182b8627cb818a2290d361b76dba0e274a32e4a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:53:47,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:53:47,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:53:47,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:53:47,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:53:47,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:53:47,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:53:47,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:53:47,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:53:47,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:53:47,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:53:47,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:53:47,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:53:47,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:53:47,524 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:53:47,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:53:47,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:53:47,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:53:47,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:53:47,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:53:47,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:53:47,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:53:47,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:53:47,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:53:47,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:53:47,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:53:47,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:53:47,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:53:47,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:53:47,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:53:47,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:53:47,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:53:47,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:47,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:53:47,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:53:47,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:53:47,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:53:47,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:53:47,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:53:47,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:53:47,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:53:47,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:53:47,545 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 -> 5f16d1adb8682acc1fc66a4b182b8627cb818a2290d361b76dba0e274a32e4a7 [2024-10-24 11:53:47,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:53:47,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:53:47,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:53:47,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:53:47,846 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:53:47,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-91.i [2024-10-24 11:53:49,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:53:49,543 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:53:49,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-91.i [2024-10-24 11:53:49,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf938e010/50c9515380a249d483f8c513ca529c48/FLAG211d142c3 [2024-10-24 11:53:49,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf938e010/50c9515380a249d483f8c513ca529c48 [2024-10-24 11:53:49,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:53:49,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:53:49,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:53:49,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:53:49,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:53:49,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:49,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66822bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49, skipping insertion in model container [2024-10-24 11:53:49,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:49,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:53:49,814 WARN L248 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_wrapper-s_file-91.i[916,929] [2024-10-24 11:53:49,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:49,883 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:53:49,897 WARN L248 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_wrapper-s_file-91.i[916,929] [2024-10-24 11:53:49,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:53:49,976 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:53:49,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49 WrapperNode [2024-10-24 11:53:49,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:53:49,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:49,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:53:49,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:53:49,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,043 INFO L138 Inliner]: procedures = 29, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578 [2024-10-24 11:53:50,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:53:50,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:53:50,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:53:50,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:53:50,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,100 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 19 writes are split as follows [0, 19]. [2024-10-24 11:53:50,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:53:50,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:53:50,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:53:50,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:53:50,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (1/1) ... [2024-10-24 11:53:50,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:50,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:53:50,198 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-10-24 11:53:50,203 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-10-24 11:53:50,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:53:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:53:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:53:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:53:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:53:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:53:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:53:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:53:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:53:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:53:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:53:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:53:50,258 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:53:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:53:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:53:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:53:50,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:53:50,464 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:53:50,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:53:51,036 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-10-24 11:53:51,036 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:53:51,073 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:53:51,074 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:53:51,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:51 BoogieIcfgContainer [2024-10-24 11:53:51,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:53:51,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:53:51,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:53:51,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:53:51,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:53:49" (1/3) ... [2024-10-24 11:53:51,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629b1e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:51, skipping insertion in model container [2024-10-24 11:53:51,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:53:49" (2/3) ... [2024-10-24 11:53:51,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629b1e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:53:51, skipping insertion in model container [2024-10-24 11:53:51,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:51" (3/3) ... [2024-10-24 11:53:51,089 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-91.i [2024-10-24 11:53:51,107 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:53:51,108 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:53:51,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:53:51,185 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;@45677a5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:53:51,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:53:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:53:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:53:51,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:51,208 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:53:51,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:51,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash -808400122, now seen corresponding path program 1 times [2024-10-24 11:53:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535365412] [2024-10-24 11:53:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:53:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:53:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:53:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:53:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:53:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:53:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:53:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:53:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:53:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:53:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:53:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:53:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:53:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:53:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:53:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:53:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:53:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:51,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535365412] [2024-10-24 11:53:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535365412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:51,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:51,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:53:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422185517] [2024-10-24 11:53:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:51,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:53:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:53:51,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:53:51,793 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:53:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:51,845 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-10-24 11:53:51,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:53:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-24 11:53:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:51,857 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:53:51,858 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:53:51,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-24 11:53:51,865 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:51,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:53:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:53:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:53:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-24 11:53:51,916 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 133 [2024-10-24 11:53:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:51,917 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-24 11:53:51,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:53:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-24 11:53:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:53:51,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:51,923 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:53:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:53:51,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash 307016424, now seen corresponding path program 1 times [2024-10-24 11:53:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548188818] [2024-10-24 11:53:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:53:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:53:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:53:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:53:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:53:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:53:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:53:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:53:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:53:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:53:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:53:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:53:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:53:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:53:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:53:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:53:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:53:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548188818] [2024-10-24 11:53:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548188818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:52,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:53:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388279845] [2024-10-24 11:53:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:53:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:52,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:53:52,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:52,267 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:53:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:52,330 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-24 11:53:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:53:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-24 11:53:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:52,335 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:53:52,335 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:53:52,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:52,339 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:52,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:53:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 11:53:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 99 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:53:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-24 11:53:52,358 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 133 [2024-10-24 11:53:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:52,362 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-24 11:53:52,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:53:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-24 11:53:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:53:52,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:52,365 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:53:52,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:53:52,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:52,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1077749990, now seen corresponding path program 1 times [2024-10-24 11:53:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874660563] [2024-10-24 11:53:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:52,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:53:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:53:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:53:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:53:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:53:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:53:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:53:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:53:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:53:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:53:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:53:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:53:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:53:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:53:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:53:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:53:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:53:52,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874660563] [2024-10-24 11:53:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874660563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:52,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:52,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:53:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641696840] [2024-10-24 11:53:52,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:52,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:53:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:53:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:52,736 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:53:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:52,771 INFO L93 Difference]: Finished difference Result 237 states and 350 transitions. [2024-10-24 11:53:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:53:52,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:53:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:52,778 INFO L225 Difference]: With dead ends: 237 [2024-10-24 11:53:52,778 INFO L226 Difference]: Without dead ends: 120 [2024-10-24 11:53:52,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:53:52,782 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:52,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:53:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-24 11:53:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-24 11:53:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:53:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-10-24 11:53:52,794 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 133 [2024-10-24 11:53:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:52,795 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-10-24 11:53:52,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:53:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-10-24 11:53:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:53:52,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:52,798 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:53:52,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:53:52,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:52,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1269605708, now seen corresponding path program 1 times [2024-10-24 11:53:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225571838] [2024-10-24 11:53:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 11:53:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 11:53:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:53:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:53:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:53:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:53:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:53:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:53:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:53:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:53:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:53:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:53:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:53:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:53:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:53:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:53:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:53:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:53:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:53:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225571838] [2024-10-24 11:53:53,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225571838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:53,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:53,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:53:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312027890] [2024-10-24 11:53:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:53,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:53:53,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:53:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:53:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:53,561 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:53:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:54,010 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2024-10-24 11:53:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:53:54,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:53:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:54,014 INFO L225 Difference]: With dead ends: 335 [2024-10-24 11:53:54,014 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 11:53:54,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:53:54,019 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 115 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:54,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 645 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:53:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 11:53:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-10-24 11:53:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.4193548387096775) internal successors, (264), 187 states have internal predecessors, (264), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:53:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 312 transitions. [2024-10-24 11:53:54,037 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 312 transitions. Word has length 135 [2024-10-24 11:53:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:54,038 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 312 transitions. [2024-10-24 11:53:54,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:53:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 312 transitions. [2024-10-24 11:53:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:53:54,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:54,040 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:53:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:53:54,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:54,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 967619883, now seen corresponding path program 1 times [2024-10-24 11:53:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:53:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652434619] [2024-10-24 11:53:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:53:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:53:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742684679] [2024-10-24 11:53:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:54,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:53:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:53:54,202 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-10-24 11:53:54,204 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-10-24 11:53:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:53:54,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:53:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:53:54,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:53:54,983 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:53:54,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:53:55,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:53:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:53:55,192 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 11:53:55,268 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:53:55,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:53:55 BoogieIcfgContainer [2024-10-24 11:53:55,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:53:55,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:53:55,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:53:55,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:53:55,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:53:51" (3/4) ... [2024-10-24 11:53:55,276 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:53:55,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:53:55,279 INFO L158 Benchmark]: Toolchain (without parser) took 5700.16ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 103.8MB in the beginning and 189.6MB in the end (delta: -85.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:53:55,283 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 119.5MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:53:55,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.38ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 84.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:53:55,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.37ms. Allocated memory is still 157.3MB. Free memory was 84.9MB in the beginning and 80.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:53:55,284 INFO L158 Benchmark]: Boogie Preprocessor took 94.25ms. Allocated memory is still 157.3MB. Free memory was 80.7MB in the beginning and 75.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:53:55,284 INFO L158 Benchmark]: RCFGBuilder took 936.73ms. Allocated memory is still 157.3MB. Free memory was 75.6MB in the beginning and 91.9MB in the end (delta: -16.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-24 11:53:55,285 INFO L158 Benchmark]: TraceAbstraction took 4194.77ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 91.3MB in the beginning and 190.7MB in the end (delta: -99.4MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2024-10-24 11:53:55,285 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 232.8MB. Free memory was 190.7MB in the beginning and 189.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:53:55,286 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.22ms. Allocated memory is still 119.5MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.38ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 84.9MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.37ms. Allocated memory is still 157.3MB. Free memory was 84.9MB in the beginning and 80.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.25ms. Allocated memory is still 157.3MB. Free memory was 80.7MB in the beginning and 75.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 936.73ms. Allocated memory is still 157.3MB. Free memory was 75.6MB in the beginning and 91.9MB in the end (delta: -16.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4194.77ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 91.3MB in the beginning and 190.7MB in the end (delta: -99.4MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 232.8MB. Free memory was 190.7MB in the beginning and 189.6MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 119, overapproximation of someUnaryDOUBLEoperation at line 46. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 100000000, 49.25, 64, 64, 1, 8.4, -0.25, -4, 64, 16, 10, 100, 128, 10 }; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] FCALL updateLastVariables() [L127] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_2 [L89] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L94] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_6 [L97] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_6 [L97] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L99] EXPR WrapperStruct00.var_1_7 [L99] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_7 [L99] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ulong() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L127] RET updateVariables() [L128] CALL step() [L58] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L58] COND FALSE !(WrapperStruct00.var_1_2 >= 50.4f) [L61] EXPR WrapperStruct00.var_1_3 [L61] EXPR WrapperStruct00.var_1_1 [L61] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L61] COND FALSE !(WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) [L68] EXPR WrapperStruct00.var_1_8 [L68] WrapperStruct00.var_1_5 = WrapperStruct00.var_1_8 [L70] EXPR WrapperStruct00.var_1_4 [L70] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] COND FALSE !(! (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_3)) [L73] EXPR WrapperStruct00.var_1_11 [L73] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10) [L73] EXPR WrapperStruct00.var_1_11 [L73] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L73] WrapperStruct00.var_1_9 = ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))) [L75] EXPR WrapperStruct00.var_1_10 [L75] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] COND FALSE !(WrapperStruct00.var_1_10 > WrapperStruct00.var_1_9) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_15 [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1 [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) [L119] EXPR WrapperStruct00.var_1_3 [L119] EXPR ((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) && ((WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_5 == ((signed short int) 32))) : (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) && ((WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_5 == ((signed short int) 32))) : (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) && ((WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_5 == ((signed short int) 32))) : (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)))) && ((! (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) ? (((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) : (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))))) : (WrapperStruct00.var_1_9 == ((unsigned long int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR (((WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) && ((WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_5 == ((signed short int) 32))) : (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)))) && ((! (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) ? (((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) : (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))))) : (WrapperStruct00.var_1_9 == ((unsigned long int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((((WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) && ((WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_5 == ((signed short int) 32))) : (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)))) && ((! (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) ? (((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) : (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))))) : (WrapperStruct00.var_1_9 == ((unsigned long int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_9) ? ((63.1 >= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((signed short int) (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_12 == ((signed short int) WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_12 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR ((((WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) && ((WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_5 == ((signed short int) 32))) : (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)))) && ((! (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) ? (((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) : (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))))) : (WrapperStruct00.var_1_9 == ((unsigned long int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_9) ? ((63.1 >= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((signed short int) (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_12 == ((signed short int) WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_12 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1] [L119-L120] return ((((WrapperStruct00.var_1_2 >= 50.4f) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) && ((WrapperStruct00.var_1_3 == (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_5 == ((signed short int) 32))) : (WrapperStruct00.var_1_5 == ((signed short int) WrapperStruct00.var_1_8)))) && ((! (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_9 == ((unsigned long int) ((((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) < (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) ? (((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4)))) : (((((WrapperStruct00.var_1_10) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))))) : (WrapperStruct00.var_1_9 == ((unsigned long int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_9) ? ((63.1 >= WrapperStruct00.var_1_7) ? ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((signed short int) (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_12 == ((signed short int) WrapperStruct00.var_1_14))) : 1) : (WrapperStruct00.var_1_12 == ((signed short int) WrapperStruct00.var_1_15))) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 1795 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1152 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 463 IncrementalHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 643 mSDtfsCounter, 463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=4, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2176/2176 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-10-24 11:53:55,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-91.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 5f16d1adb8682acc1fc66a4b182b8627cb818a2290d361b76dba0e274a32e4a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:53:57,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:53:57,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:53:57,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:53:57,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:53:57,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:53:57,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:53:57,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:53:57,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:53:57,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:53:57,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:53:57,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:53:57,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:53:57,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:53:57,838 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:53:57,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:53:57,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:53:57,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:53:57,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:53:57,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:53:57,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:53:57,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:53:57,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:53:57,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:53:57,844 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:53:57,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:53:57,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:53:57,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:53:57,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:53:57,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:53:57,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:53:57,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:53:57,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:53:57,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:53:57,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:53:57,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:53:57,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:53:57,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:53:57,848 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:53:57,849 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:53:57,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:53:57,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:53:57,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:53:57,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:53:57,850 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:53:57,850 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 -> 5f16d1adb8682acc1fc66a4b182b8627cb818a2290d361b76dba0e274a32e4a7 [2024-10-24 11:53:58,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:53:58,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:53:58,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:53:58,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:53:58,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:53:58,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-91.i [2024-10-24 11:53:59,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:54:00,037 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:54:00,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-91.i [2024-10-24 11:54:00,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ebccff81/ac89f7b9372a497a9c734c21abf1dd37/FLAG108288892 [2024-10-24 11:54:00,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ebccff81/ac89f7b9372a497a9c734c21abf1dd37 [2024-10-24 11:54:00,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:54:00,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:54:00,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:00,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:54:00,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:54:00,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfa1b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00, skipping insertion in model container [2024-10-24 11:54:00,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:54:00,292 WARN L248 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_wrapper-s_file-91.i[916,929] [2024-10-24 11:54:00,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:00,375 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:54:00,389 WARN L248 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_wrapper-s_file-91.i[916,929] [2024-10-24 11:54:00,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:54:00,487 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:54:00,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00 WrapperNode [2024-10-24 11:54:00,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:54:00,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:00,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:54:00,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:54:00,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,577 INFO L138 Inliner]: procedures = 36, calls = 187, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2024-10-24 11:54:00,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:54:00,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:54:00,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:54:00,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:54:00,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,639 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 19 writes are split as follows [0, 19]. [2024-10-24 11:54:00,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:54:00,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:54:00,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:54:00,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:54:00,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (1/1) ... [2024-10-24 11:54:00,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:54:00,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:54:00,768 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-10-24 11:54:00,773 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-10-24 11:54:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:54:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:54:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:54:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:54:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:54:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:54:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:54:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:54:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:54:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:54:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:54:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:54:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:54:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:54:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:54:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:54:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:54:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:54:00,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:54:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:54:00,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:54:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:54:00,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:54:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:54:00,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:54:00,994 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:54:00,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:54:02,184 INFO L? ?]: Removed 171 outVars from TransFormulas that were not future-live. [2024-10-24 11:54:02,184 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:54:02,230 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:54:02,230 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:54:02,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:02 BoogieIcfgContainer [2024-10-24 11:54:02,231 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:54:02,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:54:02,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:54:02,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:54:02,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:54:00" (1/3) ... [2024-10-24 11:54:02,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241379d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:54:02, skipping insertion in model container [2024-10-24 11:54:02,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:54:00" (2/3) ... [2024-10-24 11:54:02,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241379d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:54:02, skipping insertion in model container [2024-10-24 11:54:02,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:54:02" (3/3) ... [2024-10-24 11:54:02,241 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-91.i [2024-10-24 11:54:02,259 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:54:02,259 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:54:02,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:54:02,358 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;@2042f3eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:54:02,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:54:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:54:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:54:02,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:02,380 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:54:02,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash -808400122, now seen corresponding path program 1 times [2024-10-24 11:54:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:02,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688235114] [2024-10-24 11:54:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:02,405 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-10-24 11:54:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:02,408 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-10-24 11:54:02,409 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-10-24 11:54:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:02,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:54:02,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-24 11:54:02,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:02,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:02,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688235114] [2024-10-24 11:54:02,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688235114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:02,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:02,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:54:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259929080] [2024-10-24 11:54:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:02,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:54:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:54:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:54:02,877 INFO L87 Difference]: Start difference. First operand has 118 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:54:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:02,937 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2024-10-24 11:54:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:54:02,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-24 11:54:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:02,950 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:54:02,950 INFO L226 Difference]: Without dead ends: 116 [2024-10-24 11:54:02,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-10-24 11:54:02,957 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:02,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-24 11:54:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-24 11:54:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:54:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-10-24 11:54:03,008 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 133 [2024-10-24 11:54:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:03,010 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-10-24 11:54:03,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:54:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-10-24 11:54:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:54:03,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:03,018 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:54:03,027 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:54:03,218 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-10-24 11:54:03,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash 307016424, now seen corresponding path program 1 times [2024-10-24 11:54:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:03,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530540098] [2024-10-24 11:54:03,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:54:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:03,223 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-10-24 11:54:03,237 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-10-24 11:54:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:03,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:54:03,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-24 11:54:03,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:03,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:03,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530540098] [2024-10-24 11:54:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530540098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183187248] [2024-10-24 11:54:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:03,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:54:03,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:54:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:03,587 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:54:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:03,672 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-10-24 11:54:03,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:54:03,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-24 11:54:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:03,678 INFO L225 Difference]: With dead ends: 233 [2024-10-24 11:54:03,678 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:54:03,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:03,682 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:03,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:54:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:54:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 11:54:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 99 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:54:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-10-24 11:54:03,695 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 133 [2024-10-24 11:54:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:03,696 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-10-24 11:54:03,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:54:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-10-24 11:54:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:54:03,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:03,699 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:54:03,707 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-10-24 11:54:03,899 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-10-24 11:54:03,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1077749990, now seen corresponding path program 1 times [2024-10-24 11:54:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081215812] [2024-10-24 11:54:03,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:03,902 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-10-24 11:54:03,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:03,904 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-10-24 11:54:03,905 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-10-24 11:54:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:04,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:54:04,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:54:04,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:04,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:04,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081215812] [2024-10-24 11:54:04,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081215812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:04,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033929322] [2024-10-24 11:54:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:04,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:54:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:04,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:54:04,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:04,203 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:54:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:04,258 INFO L93 Difference]: Finished difference Result 237 states and 350 transitions. [2024-10-24 11:54:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:54:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:54:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:04,264 INFO L225 Difference]: With dead ends: 237 [2024-10-24 11:54:04,264 INFO L226 Difference]: Without dead ends: 120 [2024-10-24 11:54:04,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:04,269 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:04,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-24 11:54:04,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-24 11:54:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:54:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-10-24 11:54:04,285 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 133 [2024-10-24 11:54:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:04,288 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-10-24 11:54:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:54:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-10-24 11:54:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:54:04,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:04,302 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:54:04,313 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 (4)] Ended with exit code 0 [2024-10-24 11:54:04,503 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-10-24 11:54:04,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:04,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1269605708, now seen corresponding path program 1 times [2024-10-24 11:54:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:04,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405565323] [2024-10-24 11:54:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:04,506 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-10-24 11:54:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:04,509 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-10-24 11:54:04,510 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-10-24 11:54:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:04,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 11:54:04,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:04,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-24 11:54:05,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:54:05,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:54:05,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-24 11:54:05,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:05,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-10-24 11:54:05,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:05,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 51 [2024-10-24 11:54:05,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:05,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 54 [2024-10-24 11:54:05,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:05,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 65 [2024-10-24 11:54:06,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:06,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 47 [2024-10-24 11:54:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-24 11:54:06,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:06,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405565323] [2024-10-24 11:54:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405565323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:06,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:06,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:54:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368149372] [2024-10-24 11:54:06,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:54:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:54:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:54:06,147 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:54:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:10,623 INFO L93 Difference]: Finished difference Result 414 states and 602 transitions. [2024-10-24 11:54:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:54:10,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 135 [2024-10-24 11:54:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:10,627 INFO L225 Difference]: With dead ends: 414 [2024-10-24 11:54:10,627 INFO L226 Difference]: Without dead ends: 295 [2024-10-24 11:54:10,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:54:10,631 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 720 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:10,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 536 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 11:54:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-24 11:54:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 213. [2024-10-24 11:54:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 186 states have (on average 1.4193548387096775) internal successors, (264), 187 states have internal predecessors, (264), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:54:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 312 transitions. [2024-10-24 11:54:10,660 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 312 transitions. Word has length 135 [2024-10-24 11:54:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:10,661 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 312 transitions. [2024-10-24 11:54:10,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:54:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 312 transitions. [2024-10-24 11:54:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:54:10,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:10,664 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:54:10,677 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 (5)] Ended with exit code 0 [2024-10-24 11:54:10,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:54:10,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:10,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash 967619883, now seen corresponding path program 1 times [2024-10-24 11:54:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317192191] [2024-10-24 11:54:10,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:10,867 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-10-24 11:54:10,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:10,870 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-24 11:54:10,873 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 (6)] Waiting until timeout for monitored process [2024-10-24 11:54:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:11,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 11:54:11,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:11,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:54:11,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:54:11,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:54:11,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:54:11,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-24 11:54:12,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-24 11:54:12,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:12,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-10-24 11:54:12,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:12,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-10-24 11:54:12,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 47 [2024-10-24 11:54:12,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:12,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 57 [2024-10-24 11:54:13,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:13,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 60 [2024-10-24 11:54:13,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:13,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 60 [2024-10-24 11:54:13,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:13,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 71 [2024-10-24 11:54:13,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:54:13,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 48 [2024-10-24 11:54:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 11:54:13,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:13,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:13,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317192191] [2024-10-24 11:54:13,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317192191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:13,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:13,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:54:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539319128] [2024-10-24 11:54:13,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:54:13,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:54:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:54:13,775 INFO L87 Difference]: Start difference. First operand 213 states and 312 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 11:54:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:17,934 INFO L93 Difference]: Finished difference Result 706 states and 1024 transitions. [2024-10-24 11:54:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:54:17,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-10-24 11:54:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:17,939 INFO L225 Difference]: With dead ends: 706 [2024-10-24 11:54:17,939 INFO L226 Difference]: Without dead ends: 494 [2024-10-24 11:54:17,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:54:17,941 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 635 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:17,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 351 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 11:54:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-24 11:54:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 319. [2024-10-24 11:54:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 272 states have (on average 1.4044117647058822) internal successors, (382), 273 states have internal predecessors, (382), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 11:54:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 464 transitions. [2024-10-24 11:54:17,977 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 464 transitions. Word has length 135 [2024-10-24 11:54:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:17,977 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 464 transitions. [2024-10-24 11:54:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 11:54:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 464 transitions. [2024-10-24 11:54:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:54:17,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:17,980 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:54:17,990 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 (6)] Ended with exit code 0 [2024-10-24 11:54:18,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-24 11:54:18,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:18,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1331086381, now seen corresponding path program 1 times [2024-10-24 11:54:18,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223332950] [2024-10-24 11:54:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:18,182 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-10-24 11:54:18,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:18,183 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-24 11:54:18,184 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 (7)] Waiting until timeout for monitored process [2024-10-24 11:54:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:54:18,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:54:18,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:54:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:54:18,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:54:18,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:54:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223332950] [2024-10-24 11:54:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223332950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:54:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:54:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:54:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34530653] [2024-10-24 11:54:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:54:18,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:54:18,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:54:18,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:54:18,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:18,388 INFO L87 Difference]: Start difference. First operand 319 states and 464 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:54:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:54:18,438 INFO L93 Difference]: Finished difference Result 637 states and 927 transitions. [2024-10-24 11:54:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:54:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:54:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:54:18,446 INFO L225 Difference]: With dead ends: 637 [2024-10-24 11:54:18,447 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 11:54:18,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:54:18,448 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:54:18,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:54:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 11:54:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-24 11:54:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 272 states have (on average 1.3970588235294117) internal successors, (380), 273 states have internal predecessors, (380), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 11:54:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 462 transitions. [2024-10-24 11:54:18,481 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 462 transitions. Word has length 135 [2024-10-24 11:54:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:54:18,482 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 462 transitions. [2024-10-24 11:54:18,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:54:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 462 transitions. [2024-10-24 11:54:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:54:18,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:54:18,484 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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-10-24 11:54:18,493 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 (7)] Ended with exit code 0 [2024-10-24 11:54:18,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-24 11:54:18,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:54:18,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:54:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1460849003, now seen corresponding path program 1 times [2024-10-24 11:54:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:54:18,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141741304] [2024-10-24 11:54:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:54:18,686 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-10-24 11:54:18,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:54:18,689 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-24 11:54:18,691 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 (8)] Waiting until timeout for monitored process