./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_fillercode_fillercodestructure_normal_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercode_fillercodestructure_normal_file-78.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 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:46:36,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:46:36,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:46:36,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:46:36,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:46:36,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:46:36,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:46:36,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:46:36,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:46:36,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:46:36,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:46:36,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:46:36,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:46:36,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:46:36,910 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:46:36,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:46:36,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:46:36,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:46:36,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:46:36,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:46:36,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:46:36,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:46:36,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:46:36,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:46:36,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:46:36,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:46:36,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:46:36,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:46:36,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:46:36,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:46:36,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:46:36,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:46:36,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:46:36,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:46:36,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:46:36,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:46:36,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:46:36,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:46:36,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:46:36,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:46:36,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:46:36,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:46:36,918 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 -> 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 [2024-10-14 10:46:37,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:46:37,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:46:37,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:46:37,135 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:46:37,135 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:46:37,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-10-14 10:46:38,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:46:38,614 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:46:38,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-10-14 10:46:38,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559872f50/01c8970eb1d540959b925ca23d9a20eb/FLAGbb6a5459b [2024-10-14 10:46:38,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559872f50/01c8970eb1d540959b925ca23d9a20eb [2024-10-14 10:46:38,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:46:38,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:46:38,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:46:38,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:46:38,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:46:38,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:38,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1c9806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38, skipping insertion in model container [2024-10-14 10:46:38,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:38,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:46:38,796 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_fillercode_fillercodestructure_normal_file-78.i[913,926] [2024-10-14 10:46:38,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:46:38,867 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:46:38,876 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_fillercode_fillercodestructure_normal_file-78.i[913,926] [2024-10-14 10:46:38,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:46:38,953 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:46:38,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38 WrapperNode [2024-10-14 10:46:38,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:46:38,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:46:38,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:46:38,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:46:38,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:38,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,044 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-14 10:46:39,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:46:39,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:46:39,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:46:39,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:46:39,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,094 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:46:39,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:46:39,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:46:39,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:46:39,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:46:39,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (1/1) ... [2024-10-14 10:46:39,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:46:39,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:46:39,162 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-14 10:46:39,164 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-14 10:46:39,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:46:39,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:46:39,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:46:39,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:46:39,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:46:39,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:46:39,269 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:46:39,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:46:39,626 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-14 10:46:39,626 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:46:39,647 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:46:39,647 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:46:39,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:46:39 BoogieIcfgContainer [2024-10-14 10:46:39,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:46:39,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:46:39,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:46:39,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:46:39,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:46:38" (1/3) ... [2024-10-14 10:46:39,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40eafea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:46:39, skipping insertion in model container [2024-10-14 10:46:39,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:38" (2/3) ... [2024-10-14 10:46:39,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40eafea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:46:39, skipping insertion in model container [2024-10-14 10:46:39,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:46:39" (3/3) ... [2024-10-14 10:46:39,656 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-78.i [2024-10-14 10:46:39,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:46:39,670 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:46:39,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:46:39,732 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;@35c60f58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:46:39,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:46:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 10:46:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 10:46:39,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:39,754 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:39,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:39,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:39,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2085858057, now seen corresponding path program 1 times [2024-10-14 10:46:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:39,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913285861] [2024-10-14 10:46:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913285861] [2024-10-14 10:46:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913285861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:46:40,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129358310] [2024-10-14 10:46:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:46:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:46:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:46:40,162 INFO L87 Difference]: Start difference. First operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 10:46:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:40,193 INFO L93 Difference]: Finished difference Result 141 states and 238 transitions. [2024-10-14 10:46:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:46:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-10-14 10:46:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:40,201 INFO L225 Difference]: With dead ends: 141 [2024-10-14 10:46:40,201 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 10:46:40,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-14 10:46:40,210 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:40,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:46:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 10:46:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 10:46:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 10:46:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-10-14 10:46:40,265 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 120 [2024-10-14 10:46:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:40,265 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-10-14 10:46:40,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 10:46:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-10-14 10:46:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 10:46:40,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:40,272 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:40,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:46:40,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:40,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1698813291, now seen corresponding path program 1 times [2024-10-14 10:46:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:40,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88643706] [2024-10-14 10:46:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:40,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88643706] [2024-10-14 10:46:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88643706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:40,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:46:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391117846] [2024-10-14 10:46:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:46:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:40,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:46:40,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:46:40,612 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:40,651 INFO L93 Difference]: Finished difference Result 139 states and 211 transitions. [2024-10-14 10:46:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:46:40,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-10-14 10:46:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:40,654 INFO L225 Difference]: With dead ends: 139 [2024-10-14 10:46:40,655 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 10:46:40,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-14 10:46:40,657 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:40,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:46:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 10:46:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 10:46:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 10:46:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-10-14 10:46:40,666 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 120 [2024-10-14 10:46:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:40,669 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-10-14 10:46:40,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-10-14 10:46:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 10:46:40,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:40,671 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:40,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:46:40,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:40,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1308327286, now seen corresponding path program 1 times [2024-10-14 10:46:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:40,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638786090] [2024-10-14 10:46:40,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:40,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638786090] [2024-10-14 10:46:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638786090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:46:41,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048398029] [2024-10-14 10:46:41,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:41,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:46:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:46:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:46:41,065 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:41,230 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2024-10-14 10:46:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:46:41,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-10-14 10:46:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:41,233 INFO L225 Difference]: With dead ends: 209 [2024-10-14 10:46:41,233 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 10:46:41,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:46:41,235 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 80 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:41,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 272 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:46:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 10:46:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2024-10-14 10:46:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 10:46:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2024-10-14 10:46:41,264 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 121 [2024-10-14 10:46:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:41,267 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2024-10-14 10:46:41,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2024-10-14 10:46:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 10:46:41,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:41,269 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:41,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:46:41,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1244297633, now seen corresponding path program 1 times [2024-10-14 10:46:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696599012] [2024-10-14 10:46:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696599012] [2024-10-14 10:46:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696599012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:46:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763739422] [2024-10-14 10:46:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:46:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:46:41,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:46:41,538 INFO L87 Difference]: Start difference. First operand 124 states and 187 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:41,689 INFO L93 Difference]: Finished difference Result 299 states and 448 transitions. [2024-10-14 10:46:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:46:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-10-14 10:46:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:41,691 INFO L225 Difference]: With dead ends: 299 [2024-10-14 10:46:41,692 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 10:46:41,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:46:41,695 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 117 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:41,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 297 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:46:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 10:46:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2024-10-14 10:46:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 140 states have (on average 1.35) internal successors, (189), 140 states have internal predecessors, (189), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 10:46:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 297 transitions. [2024-10-14 10:46:41,735 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 297 transitions. Word has length 122 [2024-10-14 10:46:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 297 transitions. [2024-10-14 10:46:41,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 297 transitions. [2024-10-14 10:46:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 10:46:41,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:41,737 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:46:41,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash -594677605, now seen corresponding path program 1 times [2024-10-14 10:46:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141615811] [2024-10-14 10:46:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:42,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:42,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141615811] [2024-10-14 10:46:42,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141615811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:42,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:42,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 10:46:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949474126] [2024-10-14 10:46:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:42,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:46:42,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:46:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:46:42,087 INFO L87 Difference]: Start difference. First operand 198 states and 297 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:42,388 INFO L93 Difference]: Finished difference Result 563 states and 836 transitions. [2024-10-14 10:46:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 10:46:42,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-10-14 10:46:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:42,392 INFO L225 Difference]: With dead ends: 563 [2024-10-14 10:46:42,392 INFO L226 Difference]: Without dead ends: 416 [2024-10-14 10:46:42,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:46:42,397 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 257 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:42,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 735 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:46:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-14 10:46:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 354. [2024-10-14 10:46:42,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 258 states have (on average 1.3682170542635659) internal successors, (353), 258 states have internal predecessors, (353), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 10:46:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 533 transitions. [2024-10-14 10:46:42,444 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 533 transitions. Word has length 123 [2024-10-14 10:46:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:42,445 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 533 transitions. [2024-10-14 10:46:42,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 533 transitions. [2024-10-14 10:46:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 10:46:42,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:42,448 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:46:42,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash 85380765, now seen corresponding path program 1 times [2024-10-14 10:46:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930941220] [2024-10-14 10:46:42,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:42,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930941220] [2024-10-14 10:46:42,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930941220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:42,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:42,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:46:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498991914] [2024-10-14 10:46:42,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:42,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:46:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:42,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:46:42,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:46:42,805 INFO L87 Difference]: Start difference. First operand 354 states and 533 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:42,951 INFO L93 Difference]: Finished difference Result 726 states and 1084 transitions. [2024-10-14 10:46:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:46:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-10-14 10:46:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:42,953 INFO L225 Difference]: With dead ends: 726 [2024-10-14 10:46:42,954 INFO L226 Difference]: Without dead ends: 412 [2024-10-14 10:46:42,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:46:42,955 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 72 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:42,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 272 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:46:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-14 10:46:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 362. [2024-10-14 10:46:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 266 states have (on average 1.3533834586466165) internal successors, (360), 266 states have internal predecessors, (360), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 10:46:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 540 transitions. [2024-10-14 10:46:42,977 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 540 transitions. Word has length 123 [2024-10-14 10:46:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:42,977 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 540 transitions. [2024-10-14 10:46:42,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 540 transitions. [2024-10-14 10:46:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 10:46:42,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:42,979 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:42,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:46:42,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:42,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1486273052, now seen corresponding path program 1 times [2024-10-14 10:46:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376103046] [2024-10-14 10:46:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:42,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376103046] [2024-10-14 10:46:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376103046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:46:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911563030] [2024-10-14 10:46:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:43,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:46:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:43,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:46:43,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:46:43,241 INFO L87 Difference]: Start difference. First operand 362 states and 540 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:43,431 INFO L93 Difference]: Finished difference Result 921 states and 1369 transitions. [2024-10-14 10:46:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:46:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-10-14 10:46:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:43,435 INFO L225 Difference]: With dead ends: 921 [2024-10-14 10:46:43,436 INFO L226 Difference]: Without dead ends: 595 [2024-10-14 10:46:43,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:46:43,437 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 122 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:43,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 426 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:46:43,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-14 10:46:43,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 511. [2024-10-14 10:46:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 377 states have (on average 1.3501326259946949) internal successors, (509), 377 states have internal predecessors, (509), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-14 10:46:43,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2024-10-14 10:46:43,489 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 124 [2024-10-14 10:46:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:43,492 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2024-10-14 10:46:43,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2024-10-14 10:46:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 10:46:43,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:43,493 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:43,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:46:43,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:43,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:43,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1063571226, now seen corresponding path program 1 times [2024-10-14 10:46:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:43,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603015118] [2024-10-14 10:46:43,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:43,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603015118] [2024-10-14 10:46:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603015118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:43,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:43,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:46:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014155093] [2024-10-14 10:46:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:43,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:46:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:46:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:46:43,699 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:43,876 INFO L93 Difference]: Finished difference Result 1073 states and 1607 transitions. [2024-10-14 10:46:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:46:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-10-14 10:46:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:43,879 INFO L225 Difference]: With dead ends: 1073 [2024-10-14 10:46:43,879 INFO L226 Difference]: Without dead ends: 655 [2024-10-14 10:46:43,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:46:43,882 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 37 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:43,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 463 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:46:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-14 10:46:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 589. [2024-10-14 10:46:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 455 states have (on average 1.353846153846154) internal successors, (616), 455 states have internal predecessors, (616), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-14 10:46:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 868 transitions. [2024-10-14 10:46:43,924 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 868 transitions. Word has length 124 [2024-10-14 10:46:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:43,924 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 868 transitions. [2024-10-14 10:46:43,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 868 transitions. [2024-10-14 10:46:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 10:46:43,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:43,925 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:43,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:46:43,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:43,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1381213581, now seen corresponding path program 1 times [2024-10-14 10:46:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616978260] [2024-10-14 10:46:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:43,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:46:43,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1527283384] [2024-10-14 10:46:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:43,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:46:43,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:46:43,985 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-14 10:46:43,986 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-14 10:46:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:44,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 10:46:44,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:46:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-14 10:46:44,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:46:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616978260] [2024-10-14 10:46:44,995 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 10:46:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527283384] [2024-10-14 10:46:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527283384] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:46:44,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:46:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-14 10:46:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091362747] [2024-10-14 10:46:44,996 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 10:46:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:46:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:46:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:46:44,997 INFO L87 Difference]: Start difference. First operand 589 states and 868 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 10:46:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:45,450 INFO L93 Difference]: Finished difference Result 1422 states and 2052 transitions. [2024-10-14 10:46:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 10:46:45,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-10-14 10:46:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:45,454 INFO L225 Difference]: With dead ends: 1422 [2024-10-14 10:46:45,455 INFO L226 Difference]: Without dead ends: 1047 [2024-10-14 10:46:45,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-14 10:46:45,457 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 97 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:45,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 470 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:46:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-10-14 10:46:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1003. [2024-10-14 10:46:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 773 states have (on average 1.3389391979301424) internal successors, (1035), 777 states have internal predecessors, (1035), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-10-14 10:46:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1447 transitions. [2024-10-14 10:46:45,512 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1447 transitions. Word has length 129 [2024-10-14 10:46:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:45,512 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1447 transitions. [2024-10-14 10:46:45,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 10:46:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1447 transitions. [2024-10-14 10:46:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 10:46:45,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:45,514 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:45,528 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-14 10:46:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:46:45,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2059040073, now seen corresponding path program 1 times [2024-10-14 10:46:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:45,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109226910] [2024-10-14 10:46:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:46:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:46:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:46:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:46:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:46:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:46:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:46:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:46:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:46:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 10:46:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 10:46:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 10:46:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 10:46:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 10:46:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 10:46:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 10:46:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 10:46:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 10:46:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:46:45,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:46:45,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109226910] [2024-10-14 10:46:45,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109226910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:45,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:45,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:46:45,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613055629] [2024-10-14 10:46:45,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:45,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:46:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:46:45,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:46:45,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:46:45,893 INFO L87 Difference]: Start difference. First operand 1003 states and 1447 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:46:45,979 INFO L93 Difference]: Finished difference Result 1739 states and 2533 transitions. [2024-10-14 10:46:45,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:46:45,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-10-14 10:46:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:46:45,986 INFO L225 Difference]: With dead ends: 1739 [2024-10-14 10:46:45,986 INFO L226 Difference]: Without dead ends: 1336 [2024-10-14 10:46:45,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:46:45,987 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 68 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:46:45,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 410 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:46:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2024-10-14 10:46:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1006. [2024-10-14 10:46:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 776 states have (on average 1.3376288659793814) internal successors, (1038), 780 states have internal predecessors, (1038), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-10-14 10:46:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1450 transitions. [2024-10-14 10:46:46,044 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1450 transitions. Word has length 129 [2024-10-14 10:46:46,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:46:46,045 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1450 transitions. [2024-10-14 10:46:46,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:46:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1450 transitions. [2024-10-14 10:46:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 10:46:46,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:46,046 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:46,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 10:46:46,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:46,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:46,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1224809973, now seen corresponding path program 1 times [2024-10-14 10:46:46,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:46:46,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259155417] [2024-10-14 10:46:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:46:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:46:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458785367] [2024-10-14 10:46:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:46,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:46:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:46:46,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:46:46,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 10:46:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:46:46,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:46:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:46:46,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:46:46,306 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:46:46,306 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:46:46,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 10:46:46,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 10:46:46,511 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:46:46,577 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:46:46,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:46:46 BoogieIcfgContainer [2024-10-14 10:46:46,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:46:46,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:46:46,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:46:46,581 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:46:46,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:46:39" (3/4) ... [2024-10-14 10:46:46,583 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:46:46,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:46:46,584 INFO L158 Benchmark]: Toolchain (without parser) took 7943.76ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 102.6MB in the beginning and 96.8MB in the end (delta: 5.9MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. [2024-10-14 10:46:46,584 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:46:46,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.21ms. Allocated memory is still 172.0MB. Free memory was 102.3MB in the beginning and 142.0MB in the end (delta: -39.7MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-10-14 10:46:46,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.79ms. Allocated memory is still 172.0MB. Free memory was 142.0MB in the beginning and 135.1MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:46:46,585 INFO L158 Benchmark]: Boogie Preprocessor took 88.58ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 123.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 10:46:46,585 INFO L158 Benchmark]: RCFGBuilder took 512.64ms. Allocated memory is still 172.0MB. Free memory was 123.9MB in the beginning and 90.4MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 10:46:46,586 INFO L158 Benchmark]: TraceAbstraction took 6932.31ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 89.6MB in the beginning and 97.8MB in the end (delta: -8.2MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. [2024-10-14 10:46:46,586 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 302.0MB. Free memory was 97.8MB in the beginning and 96.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:46:46,587 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.14ms. Allocated memory is still 172.0MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.21ms. Allocated memory is still 172.0MB. Free memory was 102.3MB in the beginning and 142.0MB in the end (delta: -39.7MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.79ms. Allocated memory is still 172.0MB. Free memory was 142.0MB in the beginning and 135.1MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.58ms. Allocated memory is still 172.0MB. Free memory was 135.1MB in the beginning and 123.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 512.64ms. Allocated memory is still 172.0MB. Free memory was 123.9MB in the beginning and 90.4MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6932.31ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 89.6MB in the beginning and 97.8MB in the end (delta: -8.2MB). Peak memory consumption was 122.5MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 302.0MB. Free memory was 97.8MB in the beginning and 96.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L112] last_1_var_1_3 = var_1_3 [L113] last_1_var_1_6 = var_1_6 [L114] last_1_var_1_15 = var_1_15 [L115] last_1_var_1_20 = var_1_20 [L116] last_1_var_1_21 = var_1_21 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L87] var_1_9 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L88] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] var_1_10 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] var_1_14 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L100] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] var_1_17 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] var_1_18 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L107] var_1_19 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L127] RET updateVariables() [L128] CALL step() [L49] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L50] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L54] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L55] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L58] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L62] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L72] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=0, var_1_17=30, var_1_18=-31, var_1_19=1, var_1_1=0, var_1_20=75, var_1_21=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 854 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 850 mSDsluCounter, 3740 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2673 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 874 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1067 mSDtfsCounter, 874 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 565 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1006occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 669 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1622 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1225 ConstructedInterpolants, 0 QuantifiedInterpolants, 3939 SizeOfPredicates, 4 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6078/6120 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-14 10:46:46,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodestructure_normal_file-78.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 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:46:48,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:46:48,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:46:48,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:46:48,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:46:48,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:46:48,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:46:48,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:46:48,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:46:48,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:46:48,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:46:48,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:46:48,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:46:48,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:46:48,544 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:46:48,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:46:48,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:46:48,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:46:48,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:46:48,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:46:48,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:46:48,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:46:48,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:46:48,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:46:48,550 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:46:48,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:46:48,550 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:46:48,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:46:48,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:46:48,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:46:48,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:46:48,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:46:48,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:46:48,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:46:48,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:46:48,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:46:48,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:46:48,551 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:46:48,552 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:46:48,552 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:46:48,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:46:48,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:46:48,552 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:46:48,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:46:48,553 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:46:48,553 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 -> 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 [2024-10-14 10:46:48,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:46:48,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:46:48,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:46:48,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:46:48,818 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:46:48,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-10-14 10:46:50,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:46:50,240 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:46:50,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-10-14 10:46:50,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e53ee576/420b5ffc71e647fabfaef52de3ac5d76/FLAGf9e3fcd51 [2024-10-14 10:46:50,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e53ee576/420b5ffc71e647fabfaef52de3ac5d76 [2024-10-14 10:46:50,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:46:50,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:46:50,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:46:50,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:46:50,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:46:50,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5182f50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50, skipping insertion in model container [2024-10-14 10:46:50,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:46:50,455 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_fillercode_fillercodestructure_normal_file-78.i[913,926] [2024-10-14 10:46:50,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:46:50,537 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:46:50,545 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_fillercode_fillercodestructure_normal_file-78.i[913,926] [2024-10-14 10:46:50,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:46:50,581 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:46:50,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50 WrapperNode [2024-10-14 10:46:50,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:46:50,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:46:50,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:46:50,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:46:50,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,634 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-10-14 10:46:50,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:46:50,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:46:50,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:46:50,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:46:50,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,673 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:46:50,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:46:50,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:46:50,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:46:50,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:46:50,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (1/1) ... [2024-10-14 10:46:50,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:46:50,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:46:50,734 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-14 10:46:50,739 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-14 10:46:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:46:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:46:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:46:50,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:46:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:46:50,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:46:50,847 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:46:50,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:46:55,799 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 10:46:55,799 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:46:55,848 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:46:55,849 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:46:55,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:46:55 BoogieIcfgContainer [2024-10-14 10:46:55,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:46:55,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:46:55,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:46:55,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:46:55,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:46:50" (1/3) ... [2024-10-14 10:46:55,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3a73b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:46:55, skipping insertion in model container [2024-10-14 10:46:55,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:46:50" (2/3) ... [2024-10-14 10:46:55,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3a73b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:46:55, skipping insertion in model container [2024-10-14 10:46:55,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:46:55" (3/3) ... [2024-10-14 10:46:55,856 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-78.i [2024-10-14 10:46:55,869 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:46:55,869 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:46:55,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:46:55,932 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;@72cd3f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:46:55,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:46:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 10:46:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 10:46:55,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:46:55,948 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:46:55,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:46:55,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:46:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash -24766163, now seen corresponding path program 1 times [2024-10-14 10:46:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:46:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325253172] [2024-10-14 10:46:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:46:55,969 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-14 10:46:55,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:46:55,972 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-14 10:46:55,973 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-14 10:46:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:46:56,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:46:56,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:46:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-14 10:46:56,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:46:56,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:46:56,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325253172] [2024-10-14 10:46:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325253172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:46:56,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:46:56,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:46:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881214297] [2024-10-14 10:46:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:46:56,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:46:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:46:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:46:56,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:46:56,427 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 10:47:00,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:47:00,571 INFO L93 Difference]: Finished difference Result 101 states and 174 transitions. [2024-10-14 10:47:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:47:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-10-14 10:47:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:47:00,608 INFO L225 Difference]: With dead ends: 101 [2024-10-14 10:47:00,609 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 10:47:00,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-14 10:47:00,613 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:47:00,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 10:47:00,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 10:47:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 10:47:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 10:47:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-14 10:47:00,644 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 114 [2024-10-14 10:47:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:47:00,644 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-14 10:47:00,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 10:47:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-14 10:47:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 10:47:00,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:47:00,647 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:47:00,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 10:47:00,847 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-14 10:47:00,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:47:00,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:47:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash 479330465, now seen corresponding path program 1 times [2024-10-14 10:47:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:47:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129183100] [2024-10-14 10:47:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:47:00,849 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-14 10:47:00,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:47:00,851 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-14 10:47:00,852 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-14 10:47:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:47:01,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 10:47:01,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:47:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:47:03,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:47:03,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:47:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129183100] [2024-10-14 10:47:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129183100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:47:03,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:47:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:47:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376392784] [2024-10-14 10:47:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:47:03,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:47:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:47:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:47:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:47:03,074 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:47:07,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:08,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:12,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:16,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:47:16,669 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2024-10-14 10:47:16,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:47:16,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-14 10:47:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:47:16,701 INFO L225 Difference]: With dead ends: 160 [2024-10-14 10:47:16,701 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 10:47:16,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:47:16,702 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 55 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:47:16,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 253 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2024-10-14 10:47:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 10:47:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-10-14 10:47:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 10:47:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-10-14 10:47:16,721 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 114 [2024-10-14 10:47:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:47:16,723 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-10-14 10:47:16,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:47:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-10-14 10:47:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 10:47:16,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:47:16,725 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:47:16,743 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 (3)] Forceful destruction successful, exit code 0 [2024-10-14 10:47:16,926 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-14 10:47:16,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:47:16,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:47:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1180395043, now seen corresponding path program 1 times [2024-10-14 10:47:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:47:16,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734533702] [2024-10-14 10:47:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:47:16,931 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-14 10:47:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:47:16,936 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-14 10:47:16,937 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-14 10:47:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:47:17,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:47:17,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:47:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:47:17,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:47:17,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:47:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734533702] [2024-10-14 10:47:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734533702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:47:17,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:47:17,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:47:17,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049317726] [2024-10-14 10:47:17,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:47:17,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:47:17,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:47:17,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:47:17,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:47:17,292 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:47:20,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:23,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 10:47:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:47:23,040 INFO L93 Difference]: Finished difference Result 146 states and 218 transitions. [2024-10-14 10:47:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:47:23,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-14 10:47:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:47:23,072 INFO L225 Difference]: With dead ends: 146 [2024-10-14 10:47:23,072 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 10:47:23,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:47:23,076 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:47:23,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-14 10:47:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 10:47:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-14 10:47:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 10:47:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-10-14 10:47:23,095 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 114 [2024-10-14 10:47:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:47:23,096 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-10-14 10:47:23,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:47:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-10-14 10:47:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 10:47:23,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:47:23,098 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:47:23,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:47:23,299 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-14 10:47:23,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:47:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:47:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -679905, now seen corresponding path program 1 times [2024-10-14 10:47:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:47:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404616837] [2024-10-14 10:47:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:47:23,301 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-14 10:47:23,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:47:23,303 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-14 10:47:23,304 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-14 10:47:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:47:24,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:47:24,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:47:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-10-14 10:47:26,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:47:28,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:47:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404616837] [2024-10-14 10:47:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404616837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:47:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [21271714] [2024-10-14 10:47:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:47:28,450 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:47:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:47:28,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:47:28,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-14 10:47:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:47:28,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-14 10:47:28,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:47:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 10:47:33,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:47:33,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [21271714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:47:33,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:47:33,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-14 10:47:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958242087] [2024-10-14 10:47:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:47:33,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:47:33,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:47:33,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:47:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-14 10:47:33,581 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:47:37,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:42,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:44,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:49,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:53,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:55,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:47:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:47:55,240 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2024-10-14 10:47:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:47:55,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-10-14 10:47:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:47:55,245 INFO L225 Difference]: With dead ends: 224 [2024-10-14 10:47:55,245 INFO L226 Difference]: Without dead ends: 175 [2024-10-14 10:47:55,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2024-10-14 10:47:55,247 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 113 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:47:55,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 242 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 198 Invalid, 2 Unknown, 0 Unchecked, 21.2s Time] [2024-10-14 10:47:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-14 10:47:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2024-10-14 10:47:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 93 states have (on average 1.1935483870967742) internal successors, (111), 94 states have internal predecessors, (111), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-14 10:47:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2024-10-14 10:47:55,275 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 115 [2024-10-14 10:47:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:47:55,275 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2024-10-14 10:47:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 10:47:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2024-10-14 10:47:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 10:47:55,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:47:55,277 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:47:55,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-14 10:47:55,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 10:47:55,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,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-14 10:47:55,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:47:55,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:47:55,679 INFO L85 PathProgramCache]: Analyzing trace with hash 679378465, now seen corresponding path program 1 times [2024-10-14 10:47:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:47:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759538301] [2024-10-14 10:47:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:47:55,679 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-14 10:47:55,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:47:55,682 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-14 10:47:55,683 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-14 10:47:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:47:56,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 10:47:56,482 INFO L278 TraceCheckSpWp]: Computing forward predicates...